König's edge coloring theorem without augmenting paths
نویسنده
چکیده
منابع مشابه
The Complexity of Distributed Edge Coloring with Small Palettes
The complexity of distributed edge coloring depends heavily on the palette size as a functionof the maximum degree ∆. In this paper we explore the complexity of edge coloring in theLOCAL model in different palette size regimes. Our results are as follows. • We simplify the round elimination technique of Brandt et al. [9] and prove that (2∆− 2)-edge coloring requires Ω(log∆ log n...
متن کاملPartition of Graphs and Hypergraphs into Monochromatic Connected Parts
We show that two results on covering of edge colored graphs by monochromatic connected parts can be extended to partitioning. We prove that for any 2-edgecolored non-trivial r-uniform hypergraph H, the vertex set can be partitioned into at most α(H)− r+ 2 monochromatic connected parts, where α(H) is the maximum size of a set of vertices that does not contain any edge. In particular, any 2-edgec...
متن کاملOn s-t paths and trails in edge-colored graphs
In this paper we deal from an algorithmic perspective with different questions regarding monochromatic and properly edge-colored s-t paths/trails on edge-colored graphs. Given a c-edge-colored graph Gc without properly edge-colored closed trails, we present a polynomial time procedure for the determination of properly edgecolored s-t trails visiting all vertices of Gc a prescribed number of tim...
متن کاملShort-Length Menger Theorems
We give short and simple proofs of the following two theorems by Galil and Yu [3]. Let s and t be two vertices in an n-node graph G. (1) There exist k edge-disjoint s-t paths of total length O(n √ k). (2) If we additionally assume that the minimum degree of G is at least k, then there exist k edge-disjoint s-t paths, each of length O(n/k). Let G = (V , E) be an undirected n-node graph, with no ...
متن کاملMonochromatic paths on edge colored digraphs and state splittings
We look at the behavior under state splitting of distinct kinds of properties regarding monochromatic paths on edge colored digraphs. These are absorbance and independence as well as the existence of kernels, semikernels, quasikernels and Grundy functions, all of them defined in terms of monochromatic paths.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 29 شماره
صفحات -
تاریخ انتشار 1998